Optimal broadcasting in hypercubes with link faults using limited global information

We propose a fault-tolerant broadcasting algorithm for hypercubes with link faults. This algorithm is based on an extended spanning binomial tree structure that still keeps the simplicity of conventional binomial-tree-based broadcasting. In addition, it is optimal in the sense that exactly n steps are required to complete a broadcast in an n-dimensional injured hypercube with up to n 2 faulty links. We .also show that n 2 is the maximum number of faulty links that can be tolerated in any optimal broadcast scheme in an n-dimensional hypercube. To implement the proposed algorithm each node keeps information of nearby faulty links in terms of addresses for those faulty adjacent m-s&cubes that contain at least m 1 faulty links. Keyworrls: Binomial tree; Broadcasting; Fault tolerance; Hypercubes